Calculation of the Gi/g/1 Waiting-time Distribution and Its Cumulants from Pollaczek’s Formulas

نویسندگان

  • Joseph Abate
  • Gagan L. Choudhury
  • Daniel Whitt
چکیده

The steady-state waiting time in a stable GI/G/1 queue is equivalent to the maximum of a general random walk with negative drift. Thus, the distribution of the steady-state waiting time in the GI/G/1 queue is characterized by Spitzer’s (1956) formula. However, earlier, Pollaczek (1952) derived an equivalent contour-integral expression for the Laplace transform of the GI/G/1 steady-state waiting time. Since Spitzer’s formula is easier to understand probabilistically, it is better known today, but it is not so easy to apply directly except in special cases. In contrast, we show that it is easy to compute the GI/G/1 waiting-time distribution and its cumulants (and thus its moments) from Pollaczek’s formulas. For the waiting-time tail probabilities, we use numerical transform inversion, numerically integrating the Pollaczek contour integral to obtain the transform values. For the cumulants and the probability of having to wait, we directly integrate the Pollazcek contour integrals numerically. The resulting algorithm is evidently the first for a GI/G/1 queue in which neither the transform of the interarrival-time distribution nor the transform of the service-time transform distribution need be rational. The algorithm can even be applied to long-tail distributions, i.e., distributions with some infinite moments. To treat these distributions, we approximate them by suitable exponentially-damped versions of these distributions. Overall, the algorithm is remarkably simple compared to alternative algorithms requiring more structure. key words: Fe ́lix Pollaczek, queueing theory, computational probability, GI/G/1 queue, waiting time distribution, tail probabilities, random walk, Spitzer’s formula, numerical transform inversion, numerical integration, contour integrals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Waiting-time tail probabilities in queues with long-tail service-time distributions

We consider the standard GI/G/1 queue with unlimited waiting room and the first-in first-out service discipline. We investigate the steady-state waiting-time tail probabilities P(W > x) when the service-time distribution has a long-tail distribution, i.e., when the service-time distribution fails to have a finite moment generating function. We have developed algorithms for computing the waiting...

متن کامل

The Waiting-Time Distribution for the GI/G/1 Queue under the D-Policy

We study a generalization of the GI/G/1 queue in which the server is turned off at the end of each busy period and is reactivated only when the sum of the service times of all waiting customers exceeds a given threshold of size D. Using the concept of a “randomly-selected” arriving customer, we obtain as our main result a relation that expresses the waitingtime distribution of customers in this...

متن کامل

An Interpolation Approximation for the GI/G/1 Queue Based on Multipoint Padé Approximation

The performance evaluation of many complex manufacturing, communication and computer systems has been made possible by modeling them as queueing systems. Many approximations used in queueing theory have been drawn from the behavior of queues in light and heavy tra c conditions. In this paper, we propose a new approximation technique, which combines the light and heavy tra c characteristics. Thi...

متن کامل

Multiple vacation policy for MX/Hk/1 queue with un-reliable server

This paper studies the operating characteristics of an MX/Hk/1 queueing system under multiple vacation policy. It is assumed that the server goes for vacation as soon as the system becomes empty. When he returns from a vacation and there is one or more customers waiting in the queue, he serves these customers until the system becomes empty again, otherwise goes for another vacation. The brea...

متن کامل

Heavy-traffic Limit Theorems for the Heavy-tailed Gi/g/1 Queue Heavy-traac Limit Theorems for the Heavy-tailed Gi/g/1 Queue

The classic GI=G=1 queueing model of which the tail of the service time and/or the interarrival time distribution behaves as t ?v S(t) for t ! 1, 1 < v < 2 and S(t) a slowly varying function at innnity, is investigated for the case that the traac load a approaches one. Heavy-traac limit theorems are derived for the case that these tails have a similar behaviour at innnity as well as for the cas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992